Algorithms and Bounds for Overloaded Orthogonal Drawings
نویسندگان
چکیده
منابع مشابه
Algorithms and Bounds for Overloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to highdegree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placem...
متن کاملOverloaded Orthogonal Drawings
Orthogonal drawings are widely used for graph visualization due to their high clarity of representation. In this paper we present a technique called Overloaded Orthogonal Drawing. We first place the vertices on grid points following a relaxed version of dominance drawing, called weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these...
متن کاملAlgorithms and Area Bounds for Nonplanar Orthogonal Drawings
We report on some extensions of the Kandinsky model: A new and highly nontrivial technique to incorporate nonplanar drawings into the Kandinsky model in the same way as in the GIOTTO approach is presented. This means a major step towards the practical usability of our approach. The used technique even gives new insights for the solvability of network ow problems. Another variant of Kandinsky en...
متن کاملLower bounds and parallel algorithms for planar orthogonal grid drawings
W e consider the problem of constructing a planar orthogonal grid drawing (or more simply, layout) of an n-vertex graph, with the goal of minimizing the number of bends along the edges. W e exhibit graphs that require Q(n) bends in any layout, and show that there exist optimal drawings that require Q ( n ) bends and have all of them on a single edge of length !2(nz). O n the other side of the c...
متن کاملNew Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for orthogonal graph drawings. We prove lower bounds on the number of bends and, when crossings are not allowed, also lower bounds on the size of the grid. Communicated by D. Wagner: submitted July 1997; revised November 199...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2016
ISSN: 1526-1719
DOI: 10.7155/jgaa.00391